價格：免費
更新日期：2019-03-01
檔案大小：1.5M
目前版本：1.0.4
版本需求：Android 4.1 以上版本
官方網站：mailto:xavisanta2@gmail.com
- GCD: Step by step using the Euclidean Algorithm and the possibility to express it with Bezout Identity.
- Inverse Mod: Calculate the inverse in modulus: a⁻¹ mod n.
- Power Mod: Compute the solution to aᵇ mod n, step by step. Using Little Fermat Theorem or Binary when it's necessary.
